An Improved Exact Algorithm for Cubic Graph TSP
نویسندگان
چکیده
It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251), improving the previous bound O(1.260) by Eppstein.
منابع مشابه
Improved Approximation Algorithms for Graph-TSP in k-Regular Bipartite Graphs
We prove new results for approximating Graph-TSP. Speci cally, we provide a polynomial-time 9 7 approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves nding a cycle cover with relatively few cycles, which we are able t...
متن کاملAn Improved Upper Bound for TSP in Cubic 3-Connected Graphs
We consider the classical minimum Travelling Salesman Problem on the class of 3-edge-connected cubic graphs. More specifically we consider their (shortest path) metric completions. The well-known conjecture states that the subtour elimination LP relaxation on the min TSP yields a 4/3 approximation factor, yet the best known approximation factor is 3/2. The 3-edge-connected cubic graphs are inte...
متن کاملA new upper bound for the traveling salesman problem in cubic graphs
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i. e. graphs with maximum vertex degree three, and prove that the problem for an n-vertex graph can be solved inO(1.2553) time and in linear space. We show that the exact TSP algorithm of Eppstein, with some minor modifications, yields the stated result. The previous best known upper bound O(1.251) was claimed by...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملAn improved upper bound for the TSP in cubic 3-edge-connected graphs
We consider the travelling salesman problem (TSP) problem on (the metric completion of) 3-edge-connected cubic graphs. These graphs are interesting because of the connection between their optimal solutions and the subtour elimination LP relaxation. Our main result is an approximation algorithm better than the 3/2-approximation algorithm for TSP in general. © 2004 Elsevier B.V. All rights reserved.
متن کامل